CLP(PB), A Meta-Interpreter in CLP(R)
نویسنده
چکیده
Constraint logic programming is one of the most attractive research areas in logic programming. Due to [JL87] the theoretical foundation of a general constraint logic programming language scheme CLP(X ) is available. Unfortunately, implementing a CLP(X ) system for some domain X is a difficult task. The problematic points are providing a constraint solver and ensuring the incrementality of the constraint system. We propose here to use an existing CLP system as implementation environment for a new CLP language. We show that under certain conditions we can use the given constraint solver as constraint solver for the new CLP-language. We focus here on prototyping CLP(PB), where PB denotes the structure of pseudo-Boolean functions, in CLP(R), where R denotes the structure of real numbers.
منابع مشابه
Modeling Systems in CLP with Coinductive Tabling
We present a methodology for the modelling of complex program behavior in CLP. The first part of this paper is an informal description about how to represent a system in CLP. At its basic level, this representation captures the precise trace semantics of concurrent programs, or even high-level specifications, in the form of a predicate transformer. Based on traces, the method can also capture p...
متن کاملModeling Systems in CLP
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its basic level, this representation captures the trace semantics of concurrent programs, or even high-level specifications, in the form of a predicate transformer. Based on traces, the method can also capture properties of...
متن کاملDesign and Implementation of Practical Constraint Logic Programming Systems
The Constraint Logic Programming (CLP) scheme, developed by Jaffar and Lassez, defines a class of rule–based constraint programming languages. These generalize traditional logic programming languages (like Prolog) by replacing the basic operational step, unification, with constraint solving. While CLP languages have a tremendous advantage in terms of expressive power, they must be shown to be a...
متن کاملMeta-Programming in CLP(R)
A widely used property of Prolog is that it is possible to write Prolog programs to construct and manipulate other Prolog programs in a very general manner. Unfortunately , this property is not carried over to richer languages such as CLP(R) { the manipulation of CLP(R) programs in CLP(R) is quite limited. The reason is that the equality of terms in CLP(R) is not based on their syntactic struct...
متن کاملRandomised Algorithms and Constraint Logic
We propose a declarative-based implementation of randomised algorithms, which exploits the Constraint Logic Programming (CLP) paradigm. For the high-level formalisation of probabilistic programs expressing such algorithms we actually refer to a generalisation of CLP, namely the Probabilistic Concurrent Constraint Programming (PCCP) language, previously introduced in DW97]. This language provide...
متن کامل